The free local semilattice on a set

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

The canonical topology on a meet-semilattice

Considering the lattice of properties of a physical system, it has been argued elsewhere that – to build a calculus of propositions having a well-behaved notion of disjunction (and implication) – one should consider a very particular frame completion of this lattice. We show that the pertinent frame completion is obtained as sheafification of the presheaves on the given meet-semilattice with re...

Ultrafilter Spaces on the Semilattice of Partitions

a local branching approach for the set covering problem

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

Semilattice Operations on Finite Subsets

In the article we deal with a binary operation that is associative, commutative. We define for such an operation a functor that depends on two more arguments: a finite set of indices and a function indexing elements of the domain of the operation and yields the result of applying the operation to all indexed elements. The definition has a restriction that requires that either the set of indices...